On Integral Sum Numbers of Cycles
نویسندگان
چکیده
In this paper we determine that integral sum number of graph n C , namely for any integer 5 n , then 0 ) ( n C , therefore we prove that the graph ) 5 ( n Cn is an integral sum graph.
منابع مشابه
Number of Cycles of Length Four in Sum Graphs and Integral Sum Graphs
A sum graph is a graph for which there is a labeling of its vertices with positive integers so that two vertices are adjacent if and only if the sum of their labels is the label of another vertex. Integral sum graphs are defined similarly, except that the labels may be any integers. These concepts were first introduced by Harary, who provided examples of such graphs of all orders. The family of...
متن کاملOn the sum of Pell and Jacobsthal numbers by matrix method
In this paper, we define two $n$-square upper Hessenberg matrices one of which corresponds to the adjacency matrix of a directed pseudo graph. We investigate relations between permanents and determinants of these upper Hessenberg matrices, and sum formulas of the well-known Pell and Jacobsthal sequences. Finally, we present two Maple 13 procedures in order to calculate permanents of t...
متن کاملMultiple attribute decision making with triangular intuitionistic fuzzy numbers based on zero-sum game approach
For many decision problems with uncertainty, triangular intuitionistic fuzzy number is a useful tool in expressing ill-known quantities. This paper develops a novel decision method based on zero-sum game for multiple attribute decision making problems where the attribute values take the form of triangular intuitionistic fuzzy numbers and the attribute weights are unknown. First, a new value ind...
متن کاملNumerical Quadrature of Fourier Transform
In some cases the function <£(£) or \pik) is given by a closed expression which is too complicated to permit a sufficiently accurate analytic evaluation of the integral for the entire range of the parameter x. In other cases 4>ik) or ^(&) may be available only in numerical form. The conventional methods of numerical quadrature (e.g., Simpson's rule) are not suitable for evaluation of the above ...
متن کاملThe Cone of Balanced Subgraphs
In this paper we study a 2-color analog of the cycle cone of a graph. Suppose the edges of a graph are colored red and blue. A nonnegative real vector on the edges is said to be balanced if the red sum equals the blue sum at every vertex. A balanced subgraph is a subgraph whose characteristic vector is balanced (i.e., red degree equals blue degree at every vertex). By a sum (respectively, fract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011